Restricted interval guelph permeameter: Theory and application

Computing Maximum Uniquely Restricted Matchings in Restricted Interval Graphs

A uniquely restricted matching is defined to be a matching M whose matched vertices induces a sub-graph which has only one perfect matching. In this paper, we make progress on the open question of the status of this problem on interval graphs (graphs obtained as the intersection graph of intervals on a line). We give an algorithm to compute maximum cardinality uniquely restricted matchings on c...

Construction of Interval Wavelet Based on Restricted Variational Principle and Its Application for Solving Differential Equations

comparison of soil saturated hydraulic conductivity under shallow well and guelph permeameter method above the water table

to design subsurface drainage systems, it is necessary to determine the saturated hydraulic conductivity of the soil. one of the most common methods for field measurement of this parameter is the shallow well pump-in test method. another method which has recently been introduced for the above measurement is the guelph permeameter method. both methods are used to measure the soil saturated hydra...

Classes of graphs with restricted interval models

We introduce -proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs. We initiate a graph-theoretic study of subgraphs of -proper interval graphs with maximum clique size and give an equivalent characterization of these graphs by...

Uniquely Restricted Matchings in Interval Graphs

A matching M in a graph G is said to be uniquely restricted if there is no other matching in G that matches the same set of vertices as M . We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic et al. (“Uniquely restricted matchings”, M. C. Golumbic, T. Hirst and M. Lewenstein, Algorit...